Temporal Logic Veriication of Lotos Speciications Using Abstract Interpretation

نویسندگان

  • Alessandro Fantechi
  • Stefania Gnesi
  • Diego Latella
چکیده

In 6, 5] a technique for the automatic derivation of an Abstract Interpretation Domain for (the Abstract Data Types part) of LOTOS speciications has been proposed. In this paper we present an abstract model of process semantics, Abstract Trace Semantics, which is built on top of the above mentioned Abstract Interpretation Domain and which we use as a model for an abstract interpretation of a linear time temporal logics. Both Abstract Trace Semantics and the abstract interpretation of the satissability relation are proven correct w.r.t. their concrete counterparts. The main advantage of the proposed approach stems from the fact that it allows to completely automatize the veriication that a formula is satissed by a process in the abstract domain. When the formula is satissed by the process in the abstract domain, then the correctness theorem guarantees that indeed the formula holds for the process.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Step: Deductive-algorithmic Veriication of Reactive and Real-time Systems ?

The Stanford Temporal Prover, STeP, combines deductive methods with algorithmic techniques to verify linear-time temporal logic speciications of reactive and real-time systems. STeP uses veriication rules, veriication diagrams, automatically generated invariants, model checking, and a collection of decision procedures to verify nite-and innnite-state systems. computer-aided formal veriication o...

متن کامل

An Experiment using Term

Extended Abstract Introduction The purpose of this extended abstract is to report on a preliminary investigation into the use of term rewriting theorem proving to support veriication of formal description techniques for concurrent systems. The RRL 1, 2] system, particularly Knuth-Bendix completion and equational proofs, is used to investigate veriication of speciications written in the formal d...

متن کامل

A Reachability Analysis of RT-LOTOS Specifications

The paper deals with the veriication of RT-LOTOS speciications, RT-LOTOS being an acronym of Real-Time LOTOS, a temporal extension of the LOTOS FDT. Veriication is performed by reachability analysis of a timed automaton model into which a RT-LOTOS speciication may be automatically translated. Two main contributions are brought by this paper: the deenition of a new timed automaton model, the dyn...

متن کامل

STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems

The Stanford Temporal Prover, STeP, combines deductive methods with algorithmic techniques to verify linear-time temporal logic speciications of reactive and real-time systems. STeP uses veriication rules, veriication diagrams, automatically generated invariants, model checking, and a collection of decision procedures to verify nite-and innnite-state systems. computer-aided formal veriication o...

متن کامل

Compositional M-net Semantics for the Veriication of Sdl-speciications

In this paper a new approach to the veriication of SDL-speciications is presented. The key idea of the method consists in associating a compositional Petri net semantics to SDL-speciications. A temporal logic is deened which allows the formulation of relevant properties of SDL-speciications. The model checking problem for SDL-speciications according to this logic is then reduced to the model ch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994